Fast Global Optimization of Di cult

نویسندگان

  • Marco Locatelli
  • Fabio Schoen
چکیده

The minimization of the potential energy function of Lennard-Jones atomic clusters has attracted much theoretical as well as computational research in recent years. One reason for this is the practical importance of discovering low-energy conngurations of clusters of atoms, in view of applications and extensions to molecular conformation research; another reason of the success of Lennard Jones minimization in the global optimization literature is the fact that this is an extremely easy-to-state problem, yet it poses enormous diiculties for any unbiased global optimization algorithm. In this paper we propose a computational strategy which allowed us to rediscover most putative global optima known in the literature for clusters of up to 80 atoms and for other larger clusters, including the most diicult cluster conformations. The main feature of the proposed approach is the deenition of a special purpose local optimization procedure aimed at enlarging the region of attraction of the best atomic conngurations. This eeect is attained by performing rst an optimization of a modiied potential function and using the resulting local optimum as a starting point for local optimization of the Lennard Jones potential. Extensive numerical experimentation is presented and discussed, from which it can be immediately inferred that the approach presented in this paper is extremely eecient when applied to the most challenging cluster conformations. Some attempts have also been carried out on larger clusters, which resulted in the discovery of the diicult optimum for the 102 atom cluster and for the very recently discovered new putative optimum for the 98 atom cluster.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Applications of Public Domain Global Optimization Software to Di cult Econometric Functions

Finding the global optimum can be challenging. The value located by a deterministic algorithm, such as Newton's method, will depend on the starting point used. Some starting points will lead to the global optimum while others will lead to a local optima. If there are a large number of local optima, nding the global optimum, in the absence of any other information, will largely be a matter of lu...

متن کامل

A FAST GA-BASED METHOD FOR SOLVING TRUSS OPTIMIZATION PROBLEMS

Due to the complex structural issues and increasing number of design variables, a rather fast optimization algorithm to lead to a global swift convergence history without multiple attempts may be of major concern. Genetic Algorithm (GA) includes random numerical technique that is inspired by nature and is used to solve optimization problems. In this study, a novel GA method based on self-a...

متن کامل

Augmented Downhill Simplex a Modified Heuristic Optimization Method

Augmented Downhill Simplex Method (ADSM) is introduced here, that is a heuristic combination of Downhill Simplex Method (DSM) with Random Search algorithm. In fact, DSM is an interpretable nonlinear local optimization method. However, it is a local exploitation algorithm; so, it can be trapped in a local minimum. In contrast, random search is a global exploration, but less efficient. Here, rand...

متن کامل

Global optimization methods for protein folding problems

The problem of nding the naturally occurring structure of a pro tein is believed to correspond to minimizing the free or potential energy of the protein This is generally a very di cult global optimizationproblem with a large number of parameters and a huge number of local minimizers includ ing many with function values near that of the global minimizer This paper presents a new global optimiza...

متن کامل

D.C. Optimization Approach to Robust Control: Feasibility Problems

The feasibility problem for constant scaling in output feedback control is considered. This is an inherently di cult problem [20, 21] since the set of feasible solutions is nonconvex and may be disconnected. Nevertheless, we show that this problem can be reduced to the global maximization of a concave function over a convex set, or alternatively, to the global minimization of a convex program w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000